Using multi-tiered cache to satisfy input/output requests

ABSTRACT

A computer-implemented method, according to one approach, includes: determining whether to satisfy an I/O request using a first tier of memory in a secondary cache by inspecting a bypass indication in response to determining that the input/output (I/O) request includes a bypass indication. The secondary cache is coupled to a primary cache and a data storage device. The secondary cache also includes the first tier of memory and a second tier of memory. Moreover, in response to determining to satisfy the I/O request using the first tier of memory in the secondary cache, the I/O request is satisfied using the first tier of memory in the secondary cache. The updated data is also destaged from the secondary cache to the data storage device in response to determining that data associated with the I/O request has been updated as the result of satisfying the I/O request using the secondary cache.

BACKGROUND

The present invention relates to data storage systems, and more particularly, this invention relates to using multi-tiered cache having different respective performance levels to satisfy input/output (I/O) requests.

Random access memory (RAM) is a type of memory which operates in a fundamentally unique manner compared to traditional sequential access memory. For example, the performance characteristics of NAND Flash-based solid state drives (SSDs) are different from those of sequential hard disk drives (HDDs). Data in conventional SSDs is typically organized in pages of 4, 8, or 16 KB sizes. Moreover, page read operations in SSDs are typically one order of magnitude faster than write operations and latency depends on neither the current, nor the previous, location of operations.

However, in RAM, memory locations are erased in blocks prior to being written to. Specifically, due to the limitations of current NAND memory technology, an invalidated data location cannot be reused until the entire block it belongs to has been erased. Before erasing, though, the block undergoes garbage collection, whereby any valid data in the block is relocated to a new block. Garbage collection of a block is typically deferred for as long as possible to maximize the amount of invalidated data in the block, and thus reduce the number of valid pages that are relocated, as relocating data causes additional write operations, and thereby increases write amplification.

While RAM is able to achieve faster read and write performance in comparison to sequential access memory, the physical cells that store bits of information therein can only be written to a finite number of times before they begin to wear out. For instance, the raw bit error rate (RBER) of a memory block in RAM will typically increase over time due to additional program/erase (P/E) cycling, charge leakage over time (i.e., data retention), and additional charge placed in the cells by read or program operations (i.e., read or program disturb errors, respectively). Typically, a memory block in RAM is retired when any page in the block exhibits a code word that reaches a page retirement error count limit.

RAM also has a higher cost associated therewith in comparison to sequential access memory. As a result, storage capacity in RAM implementations is typically limited and operations involving larger amounts of data create performance bottlenecks. Similarly, data that has been recalled to RAM to perform an operation may not be used again for a substantial amount of time, thereby polluting the RAM by restricting use of valuable storage capacity until the data itself is reused or forced out of the RAM.

It follows that conventional implementations of RAM and the management of data therein have suffered from inefficiencies stemming from the foregoing issues. These inefficiencies have also had negative effects on performance of the overarching storage systems as a whole.

SUMMARY

A computer-implemented method, according to one approach, includes: determining whether to satisfy an I/O request using a first tier of memory in a secondary cache by inspecting a bypass indication in response to determining that the input/output (I/O) request includes a bypass indication. The secondary cache is coupled to a primary cache and a data storage device. The secondary cache also includes the first tier of memory and a second tier of memory. Moreover, in response to determining to satisfy the I/O request using the first tier of memory in the secondary cache, the I/O request is satisfied using the first tier of memory in the secondary cache. The updated data is also destaged from the secondary cache to the data storage device in response to determining that data associated with the I/O request has been updated as the result of satisfying the I/O request using the secondary cache.

A system, according to another approach, includes: a processor which is coupled to: a primary cache, a secondary cache, and a data storage device. The secondary cache also includes a first tier of memory and a second tier of memory, where the performance characteristics associated with the first tier of memory in the secondary cache are greater than performance characteristics associated with the second tier of memory in the secondary cache. The system also includes logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. Moreover, the logic is configured to: perform the foregoing method.

A computer program product, according to yet another approach, includes a computer readable storage medium having program instructions embodied therewith. The program instructions are also readable and/or executable by a processor to cause the processor to: perform the foregoing method.

Other aspects and approaches of the present invention will become apparent from the following detailed description, which, when taken in conjunction with the drawings, illustrate by way of example the principles of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of a non-volatile memory card, in accordance with one approach.

FIG. 2 is a diagram of a data storage system architecture, in accordance with one approach.

FIG. 3 is a system diagram, in accordance with one approach.

FIG. 4 is a conceptual diagram which includes a block-stripe and page-stripe, in accordance with one approach.

FIG. 5 is a partial representational view of a data storage system, in accordance with one approach.

FIG. 6A is a flowchart of a method, in accordance with one approach.

FIG. 6B is a flowchart of sub-processes for one or more of the operations in the method of FIG. 6A, in accordance with one approach.

FIG. 6C is a flowchart of sub-processes for one or more of the operations in the method of FIG. 6A, in accordance with one approach.

FIG. 6D is a flowchart of sub-processes for one or more of the operations in the method of FIG. 6A, in accordance with one approach.

FIG. 7 is a network architecture, in accordance with one approach.

FIG. 8 is a representative hardware environment that may be associated with the servers and/or clients of FIG. 7 , in accordance with one approach.

FIG. 9 is a diagram of a tiered data storage system in accordance with one approach.

FIG. 10 depicts a cloud computing environment in accordance with one approach.

FIG. 11 depicts abstraction model layers in accordance with one approach.

DETAILED DESCRIPTION

The following description is made for the purpose of illustrating the general principles of the present invention and is not meant to limit the inventive concepts claimed herein. Further, particular features described herein can be used in combination with other described features in each of the various possible combinations and permutations.

Unless otherwise specifically defined herein, all terms are to be given their broadest possible interpretation including meanings implied from the specification as well as meanings understood by those skilled in the art and/or as defined in dictionaries, treatises, etc.

It must also be noted that, as used in the specification and the appended claims, the singular forms “a,” “an” and “the” include plural referents unless otherwise specified. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

The following description discloses several preferred approaches of data storage systems, as well as operation and/or component parts thereof. It should be appreciated that various approaches herein can be implemented with a wide range of memory mediums, including for example non-volatile random access memory (NVRAM) technologies such as NAND Flash memory, NOR Flash memory, phase-change memory (PCM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), etc. To provide a context, and solely to assist the reader, various approaches herein may be described with reference to a particular type of non-volatile memory. This has been done by way of example only, and should not be deemed limiting on the invention defined in the claims.

In one general approach, a computer-implemented method includes: receiving an I/O request, and determining whether the I/O request includes a bypass indication. In response to determining that the I/O request does not include a bypass indication, the I/O request is satisfied using a primary cache which is coupled to a secondary cache and a data storage device. A determination is made as to whether data associated with the I/O request has been updated as a result of satisfying the I/O request. In response to determining that the data associated with the I/O request has been updated as a result of satisfying the I/O request: the updated data is destaged from the primary cache to the data storage device, the updated data is copied to the secondary cache, and the updated data is further demoted from the primary cache. Yet, in response to determining that the data associated with the I/O request has not been updated as a result of satisfying the I/O request: the data associated with the I/O request is copied to the secondary cache, and the data associated with the I/O request is demoted from the primary cache. It should also be noted that the secondary cache preferably includes SCM.

In another general approach, a computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a processor to cause the processor to: perform the foregoing method.

In yet another general approach, a system includes: a processor that is coupled to a primary cache and a secondary cache. The secondary cache includes a first tier of SCM and a second tier of SCM. The system also includes logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to: perform the foregoing method.

In another general approach, a computer-implemented method includes: receiving an I/O request, and determining whether the I/O request includes a bypass indication. In response to determining that the I/O request includes a bypass indication, satisfying the I/O request using a secondary cache which is coupled to a primary cache and a data storage device. Moreover, the primary cache includes dynamic random access memory, while the secondary cache includes a first tier of storage class memory and a second tier of storage class memory. A determination is also made as to whether data associated with the I/O request has been updated as a result of satisfying the I/O request. In response to determining that the data associated with the I/O request has been updated as a result of satisfying the I/O request, the updated data is destaged from the secondary cache to the data storage device.

In yet another general approach, a system includes: a processor which is coupled to: a primary cache, a secondary cache, and a data storage device. The primary cache includes dynamic random access memory, while the secondary cache includes a first tier of storage class memory and a second tier of storage class memory. The system also includes logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to: perform the foregoing method.

FIG. 1 illustrates a memory card 100, in accordance with one approach. It should be noted that although memory card 100 is depicted as an exemplary non-volatile data storage card in the present approach, various other types of non-volatile data storage cards may be used in a data storage system according to alternate approaches. It follows that the architecture and/or components of memory card 100 are in no way intended to limit the invention, but rather have been presented as a non-limiting example.

Moreover, as an option, the present memory card 100 may be implemented in conjunction with features from any other approach listed herein, such as those described with reference to the other FIGS. However, such memory card 100 and others presented herein may be used in various applications and/or in permutations which may or may not be specifically described in the illustrative approaches listed herein. Further, the memory card 100 presented herein may be used in any desired environment.

With continued reference to FIG. 1 , memory card 100 includes a gateway 102, a general purpose processor (GPP) 112 (such as an ASIC, FPGA, CPU, etc.) connected to a GPP memory 114 (which may comprise RAM, ROM, battery-backed DRAM, phase-change memory PC-RAM, MRAM, STT-MRAM, etc., or a combination thereof), and a number of memory controllers 108, which include Flash controllers in the present example. Each memory controller 108 is connected to a plurality of NVRAM memory modules 104 (which may comprise NAND Flash or other non-volatile memory type(s) such as those listed above) via channels 106.

According to various approaches, one or more of the controllers 108 may be or include one or more processors, and/or any logic for controlling any subsystem of the memory card 100. For example, the controllers 108 typically control the functions of NVRAM memory modules 104 such as, data writing, data recirculation, data reading, etc. The controllers 108 may operate using logic known in the art, as well as any logic disclosed herein, and thus may be considered as a processor for any of the descriptions of non-volatile memory included herein, in various approaches.

Moreover, the controller 108 may be configured and/or programmable to perform or control some or all of the methodology presented herein. Thus, the controller 108 may be considered to be configured to perform various operations by way of logic programmed into one or more chips, modules, and/or blocks; software, firmware, and/or other instructions being available to one or more processors; etc., and combinations thereof.

Referring still to FIG. 1 , each memory controller 108 is also connected to a controller memory 110 which preferably includes a cache which replicates a non-volatile memory structure according to the various approaches described herein. However, depending on the desired approach, the controller memory 110 may be battery-backed DRAM, phase-change memory PC-RAM, MRAM, STT-MRAM, etc., or a combination thereof.

As previously mentioned, memory card 100 may be implemented in various types of data storage systems, depending on the desired approach. FIG. 2 illustrates a data storage system architecture 200 according to an exemplary approach which is in no way intended to limit the invention. Moreover, it should be noted that the data storage system 220 of FIG. 2 may include various components found in the approach of FIG. 1 .

Looking to FIG. 2 , the data storage system 220 comprises a number of interface cards 202 configured to communicate via I/O interconnections 204 to one or more processor systems 201. The data storage system 220 may also comprise one or more RAID controllers 206 configured to control data storage in a plurality of non-volatile data storage cards 208. The non-volatile data storage cards 208 may comprise NVRAM, Flash memory cards, RAM, ROM, and/or some other known type of non-volatile memory.

The I/O interconnections 204 may include any known communication protocols, such as Fiber Channel (FC), FC over Ethernet (FCoE), Infiniband, Internet Small Computer System Interface (iSCSI), Transport Control Protocol/Internet Protocol (TCP/IP), Peripheral Component Interconnect Express (PCIe), etc., and/or any combination thereof.

The RAID controller(s) 206 in the data storage system 220 may perform a parity scheme similar to that employed by RAID-5, RAID-10, or some other suitable parity scheme, as would be understood by one of skill in the art upon reading the present descriptions.

Each processor system 201 comprises one or more processors 210 (such as CPUs, microprocessors, etc.), local data storage 211 (e.g., such as RAM 814 of FIG. 8 , ROM 816 of FIG. 8 , etc.), and an I/O adapter 218 configured to communicate with the data storage system 220.

Referring again to FIG. 1 , memory controllers 108, GPP 112, and/or other controllers described herein (e.g., RAID controllers 206 of FIG. 2 ) may be able to perform various functions on stored data, depending on the desired approach. Specifically, memory controllers or GPP 112 may include logic configured to perform any one or more of the following functions, which are in no way intended to be an exclusive list. In other words, depending on the desired approach, logic of a storage system may be configured to perform additional or alternative functions, as would be appreciated by one skilled in the art upon reading the present description.

Garbage Collection

Garbage collection in the context of SSD memory controllers of the present description may include the process of identifying blocks of data to be reclaimed for future usage and relocating all pages that are still valid therein. Moreover, depending on the specific controller and/or the respective garbage collection unit of operation, logic erase blocks (LEBs) may be identified for being reclaimed and/or relocated. Typically, one LEB corresponds to one block stripe, but alternative implementations may consider a fixed number of block stripes or a single block building a LEB as well.

A physical “block” represents a minimal unit that may be erased on non-volatile memory, e.g., such as NAND Flash memory, and thereby prepared for writing data thereto. However, a typical garbage collection unit of operation is often a multiple of the physical blocks of non-volatile memory, and is also referred to herein as a LEB. This is due to the fact that typically RAID-like parity information is added in LEBs. Therefore, in case of a page or block failure data can only be rebuilt when all blocks in the LEB are still holding data. Accordingly, the individual blocks from the garbage collection unit can only be erased either individually or in a single unit once all still valid data from all blocks in the LEB has been relocated successfully to new locations. Hence, the full garbage collection units are garbage-collected as a single unit. Moreover, the size of the LEB directly affects the garbage collection induced write amplification. The larger the LEB, the more likely it becomes that unrelated data are stored together in the LEB, and therefore more of the LEB data may have to be relocated upon garbage collection selection.

Frequently, blocks from different dies and/or flash channels are grouped together, such that blocks from the same group can be read or written in parallel, thereby increasing overall bandwidth. It is also possible to combine the previous two methods, and to compose RAID stripes using blocks from different flash channels that can be accessed in parallel.

It should also be noted that an LEB may include any multiple of the physical memory block, which is a unit of physical erasure. Moreover, the organization of memory blocks into LEB s not only allows for adding RAID-like parity protection schemes among memory blocks from different memory chips, memory planes and/or channels but also allows for significantly enhancing performance through higher parallelism. For instance, multiple non-volatile memory blocks may be grouped together in a RAID stripe. As will be appreciated by one skilled in the art upon reading the present description, RAID schemes generally improve reliability and reduce the probability of data loss.

According to an exemplary approach, which is in no way intended to limit the invention, memory controllers (e.g., see 108 and/or GPP 112 of FIG. 1 ) may internally perform a garbage collection. As previously mentioned, the garbage collection may include selecting a LEB to be relocated, after which all data that is still valid on the selected LEB may be relocated (e.g., moved). After the still valid data has been relocated, the LEB may be erased and thereafter, used for storing new data. The amount of data relocated from the garbage collected LEB determines the write amplification. Moreover, an efficient way to reduce the write amplification includes implementing heat segregation.

Heat Segregation

In the present context, the “write heat” of data refers to the rate (e.g., frequency) at which the data is updated (e.g., rewritten with new data). Memory blocks that are considered “hot” tend to have a frequent updated rate, while memory blocks that are considered “cold” have an update rate slower than hot blocks.

Tracking the write heat of a logical page may involve, for instance, allocating a certain number of bits in the logical-to-physical table (LPT) mapping entry for the page to keep track of how many write operations the page has seen in a certain time period or window. Typically, host write operations increase the write heat whereas internal relocation writes decrease the write heat. The actual increments and/or decrements to the write heat may be deterministic or probabilistic.

Similarly, read heat may be tracked with a certain number of additional bits in the LPT for each logical page. To reduce meta-data, read heat can also be tracked at a physical block level where separate counters per block for straddling and non-straddling reads can be maintained. However, it should be noted that the number of read requests to and/or read operations performed on a memory block may not come into play for heat segregation when determining the heat of the memory block for some approaches. For example, if data is frequently read from a particular memory block, the high read frequency does not necessarily mean that memory block will also have a high update rate. Rather, a high frequency of read operations performed on a given memory block may denote an importance, value, etc. of the data stored in the memory block.

By grouping memory blocks of the same and/or similar write heat values, heat segregation may be achieved. In particular, heat segregating methods may group hot memory pages together in certain memory blocks while cold memory pages are grouped together in separate memory blocks. Thus, a heat segregated LEB tends to be occupied by either hot or cold data.

The merit of heat segregation is two-fold. First, performing a garbage collection process on a hot memory block will prevent triggering the relocation of cold data as well. In the absence of heat segregation, updates to hot data, which are performed frequently, also results in the undesirable relocations of all cold data collocated on the same LEB as the hot data being relocated. Therefore, the write amplification incurred by performing garbage collection is much lower for approaches implementing heat segregation.

Secondly, the relative heat of data can be utilized for wear leveling purposes. For example, hot data may be placed in healthier (e.g., younger) memory blocks, while cold data may be placed on less healthy (e.g., older) memory blocks relative to those healthier memory blocks. Thus, the rate at which relatively older blocks are exposed to wear is effectively slowed, thereby improving the overall endurance of a given data storage system implementing heat segregation.

Write Allocation

Write allocation includes placing data of write operations into free locations of open LEBs. As soon as all pages in a LEB have been written, the LEB is closed and placed in a pool holding occupied LEBs. Typically, LEB s in the occupied pool become eligible for garbage collection. The number of open LEBs is normally limited and any LEB being closed may be replaced, either immediately or after some delay, with a fresh LEB that is being opened.

During performance, garbage collection may take place concurrently with user write operations. For example, as a user (e.g., a host) writes data to a device, the device controller may continuously perform garbage collection on LEBs with invalid data to make space for the new incoming data pages. As mentioned above, the LEBs having the garbage collection being performed thereon will often have some pages that are still valid at the time of the garbage collection operation; thus, these pages are preferably relocated (e.g., written) to a new LEB.

Again, the foregoing functions are in no way intended to limit the capabilities of any of the storage systems described and/or suggested herein. Rather, the aforementioned functions are presented by way of example, and depending on the desired approach, logic of a storage system may be configured to perform additional or alternative functions, as would be appreciated by one skilled in the art upon reading the present description.

Referring now to FIG. 3 , a system 300 is illustrated in accordance with one approach. As an option, the present system 300 may be implemented in conjunction with features from any other approach listed herein, such as those described with reference to the other FIGS. However, such system 300 and others presented herein may be used in various applications and/or in permutations which may or may not be specifically described in the illustrative approaches listed herein. Further, the system 300 presented herein may be used in any desired environment, e.g., in combination with a controller.

As illustrated, system 300 includes a write cache 302 which is coupled to several other components, including garbage collector 304. As previously mentioned, garbage collector 304 may be used to free LEB units by relocating valid data and providing non-volatile memory blocks to be erased for later reuse. Thus, the garbage collector 304 may reclaim blocks of consecutive physical space, depending on the desired approach. According to an exemplary approach, block erase units may be used to keep track of and/or complete the erase of non-volatile memory blocks handed over by the garbage collector 304.

Write cache 302 is also coupled to free block manager 306 which may keep track of free non-volatile memory blocks after they have been erased. Moreover, as would be appreciated by one of ordinary skill in the art upon reading the present description, the free block manager 306 may build free stripes of non-volatile memory blocks from different lanes (e.g., block-stripes) using the erased free non-volatile memory blocks.

Referring still to FIG. 3 , write cache 302 is coupled to LPT manager 308 and memory I/O unit 310. The LPT manager 308 maintains the logical-to-physical mappings of logical addresses to physical pages in memory. According to an example, which is in no way intended to limit the invention, the LPT manager 308 may maintain the logical-to-physical mappings of 4 KiB or 16 KiB logical addresses. The memory I/O unit 310 communicates with the memory chips in order to perform low level operations, e.g., such as reading one or more non-volatile memory pages, writing a non-volatile memory page, erasing a non-volatile memory block, etc.

To better understand the distinction between block-stripes and page-stripes as used herein, FIG. 4 is a conceptual diagram 400, in accordance with one approach. LEBs are built from block stripes and typically a single block stripe is used to build a LEB. However, alternative approaches may use multiple block stripes to form an LEB. As an option, the present conceptual diagram 400 may be implemented in conjunction with features from any other approach listed herein, such as those described with reference to the other FIGS. However, such conceptual diagram 400 and others presented herein may be used in various applications and/or in permutations which may or may not be specifically described in the illustrative approaches listed herein. Further, the controller conceptual diagram 400 presented herein may be used in any desired environment. Thus, the exemplary non-volatile memory controller conceptual diagram 400 of FIG. 4 may be implemented in a cache architecture. However, depending on the desired approach, the conceptual diagram 400 of FIG. 4 may be implemented in defining the organization of data stored in non-volatile memory. Accordingly, both implementations are described in turn below.

Non-Volatile Memory

Looking now to FIG. 4 , the conceptual diagram 400 includes a set of M+1 aggregated planes labeled “Plane 0” through “Plane M”. An aggregated plane consists of all physical planes with the same plane index on different channels. It should be noted that aggregated planes are also referred to herein simply as planes.

When implemented with data stored in non-volatile memory, each physical plane on a channel may include a large set of blocks, e.g., typically in the order of 1024, 2048 or more. Moreover, one or more physical planes may also include several additional blocks which may be used as replacement blocks for bad blocks (e.g., blocks performing poorly, blocks having undesirable characteristics, etc.).

In each plane of non-volatile memory, a single block from each channel may form a respective block-stripe. It follows that a number of block-stripes supported by a given approach of non-volatile memory may be determined by the number of blocks per plane and the number of planes.

In the exploded view of Plane 0, the conceptual diagram 400 further illustrates a single block-stripe (Block-stripe 0) out of the set of block-stripes supported in the remainder of the planes. Block-stripe 0 of plane 0 is shown as including 11 blocks, one block from each channel labeled “Channel 0” through “Channel 10”. It should be noted that the association of blocks to block-stripe can change over time as block-stripes are typically dissolved after they have been garbage collected. Erased blocks may be placed in free block pools, whereby new block-stripes are assembled from blocks in the free block pools when write allocation requests fresh block-stripes. For example, looking to conceptual diagram 400, Block 10 from Channel 0 and Block 41 from Channel 4 are currently associated with the illustrated Block-stripe 0 of Plane 0. Furthermore, the illustrated Block-stripe 0 holds N+1 page-stripes and each block therefore holds N+1 pages labeled “Page 0” through “Page N”.

Cache Architecture

Referring still to FIG. 4 , each block of pages illustrated in the exploded view of aggregated Plane 0 may constitute a unique block from one channel when implemented in a cache architecture. Similarly, each channel contributes a single, individual block which form a block-stripe. For example, looking to conceptual diagram 400, Block 10 from Channel 0 includes all pages (Page 0 through Page N) therein, while Block 41 from Channel 4 corresponds to all pages therein, and so on.

In the context of a memory controller, e.g., which may be capable of implementing RAID at the channel level, a block-stripe is made up of multiple blocks which amount to a stripe of blocks. Looking still to FIG. 4 , the multiple blocks of aggregated Plane 0 constitute Block-stripe 0. While all blocks in a block-stripe typically belong to the same aggregated plane, in some approaches one or more blocks of a block-stripe may belong to different physical planes. It follows that each aggregated plane may include one or more block-stripe. Thus, according to an illustrative approach, Block 0 through Block 10 from different physical planes may constitute a block-stripe.

Regardless of whether the conceptual diagram 400 of FIG. 4 is implemented with non-volatile memory and/or a cache architecture, in different approaches, the number of pages in each block and/or the number of channels in each plane may vary depending on the desired approach. According to an exemplary approach, which is in no way intended to limit the invention, a block may include 256 pages, but could include more or fewer in various approaches. Analogously, the number of channels per plane and/or the number of planes may vary depending on the desired approach.

Referring still to FIG. 4 , all pages in a block-stripe with the same page index denote a page-stripe. For example, Page-stripe 0 includes the first page (Page 0) of each channel in Block-stripe 0 of Plane 0. Similarly, Page-stripe N includes the last page (Page N) of each channel in Block-stripe 0 of Plane 0.

As previously mentioned, RAM is a type of memory which operates in a fundamentally unique manner compared to traditional sequential access memory. While this fundamentally different manner of operation allows for RAM to achieve faster read and write performance in comparison to sequential access memory, the physical cells that store bits of information therein can only be written to a finite number of times before they begin to wear out. For instance, the RBER of a memory block in RAM will typically increase over time due to additional P/E cycling, charge leakage over time (i.e., data retention), and additional charge placed in the cells by read or program operations (i.e., read or program disturb errors, respectively). As a result, write operations performed in RAM have a lasting effect on memory longevity, particularly in conventional storage implementations.

RAM also has a higher cost associated therewith in comparison to sequential access memory. As a result, storage capacity in RAM implementations is typically limited and operations involving larger amounts of data create performance bottlenecks. Similarly, data that has been recalled to RAM to perform an operation may not be used again for a substantial amount of time, thereby polluting the RAM by restricting use of valuable storage capacity until the data itself is reused or forced out of the RAM. Limited storage capacity in RAM also magnifies the accumulation of wear caused by write operations that are performed therein.

It follows that conventional implementations of RAM and the management of data therein have suffered from inefficiencies stemming from the foregoing issues. These inefficiencies have also had negative effects on performance of the overarching storage systems as a whole.

In sharp contrast to the foregoing shortcomings experienced in conventional implementations, various ones of the approaches included herein introduce multi-tiered cache, where each tier of the cache utilizes a different type of RAM having a different level of performance associated therewith. This allows for a higher performance tier of RAM to be reserved for certain types of data operations, while a lower performance tier of RAM is used to perform a remainder of data operations. As a result, these approaches are not only able to achieve efficient performance of I/O requests by balancing the performance characteristics of the different tiers, but also increase the effective lifetime of the physical memory itself, e.g., as will be described in further detail below.

Looking now to FIG. 5 , a data storage system 500 is illustrated in accordance with one approach. As an option, the present data storage system 500 may be implemented in conjunction with features from any other approach listed herein, such as those described with reference to the other FIGS. However, such data storage system 500 and others presented herein may be used in various applications and/or in permutations which may or may not be specifically described in the illustrative approaches listed herein. Further, the data storage system 500 presented herein may be used in any desired environment. Thus FIG. 5 (and the other FIGS.) may be deemed to include any possible permutation.

As shown, the data storage system 500 includes a controller 502 which is coupled to a cache module 504 and a local data storage device 506. Depending on the implementation, the controller 502 may be coupled to the cache module 504 and/or the local data storage device 506 using a wireless connection, e.g., WiFi, Bluetooth, a cellular network, etc.; a physical electrical connection, e.g., a cable, a fiber-optic link, a wire, etc.; etc., or any other type of connection which would be apparent to one skilled in the art after reading the present description.

The controller 502 is also coupled to a remote data storage location 508 via a network 510, e.g., as will be described in further detail below. The controller 502 may be any desired type of controller, e.g., such as a central storage controller, a data processor, a general computing device, etc., or some other device having one or more processors included therein. Accordingly, the controller 502 may be able to receive and satisfy I/O requests from a host 511, running applications, other data storage systems that are connected to the network 510, etc.

The local data storage device 506 may include one or more different types of data storage components including, but not limited to, HDDs, tape libraries, SSDs, etc. The local data storage device 506 may thereby serve as an on-location data storage option for the controller 502. An effective storage capacity of the local data storage device 506 may also vary depending on the type(s) of data storage component(s) included therein, anticipated throughput of the system 500, etc.

While the local data storage device 506 is able to store data for the system 500, the remote data storage location 508 provides additional storage capacity that may be utilized as desired. Moreover, the remote data storage location 508 may be positioned at any desired location so long as it is able to maintain a connection with the network 510. It follows that the network 510 may be of any type, e.g., depending on the desired approach. For instance, in some approaches the network 510 is a WAN, e.g., such as the Internet. However, an illustrative list of other network types which network 510 may implement includes, but is not limited to, a LAN, a PSTN, a SAN, an internal telephone network, etc. Accordingly, the controller 502 and the remote data storage location 508 are able to communicate with each other regardless of the amount of separation which exists therebetween, e.g., despite being positioned at different geographical locations.

In some approaches, the remote data storage location 508 may be cloud object storage implemented as a part of a cloud computing environment (e.g., see FIGS. 10-11 below). In such approaches, data may be recalled directly from storage in the cloud computing environment and into the cache module 504. This recalled data can replace the current hot data in the cache 504, however some of the recalled data may not be actually used for some time. Accordingly, portions of the recalled data may effectively pollute the cache 504, especially the primary cache 512, until it is flushed out (e.g., ages out). To solve this issue, some of the recalled data may selectively bypass the primary cache 512 and be stored in secondary cache 514. The data recall operations are able to distinguish the basis of the data recall and decide if the data should be transitioned into the primary cache 512 or secondary cache 514, e.g., as will be described in further detail below with respect to FIGS. 6A-6D.

With continued reference to FIG. 5 , the cache module 504 includes a primary cache 512 and a secondary cache 514. Each of the primary and secondary cache 512, 514 preferably have different performance characteristics associated therewith. For instance, the primary cache 512 preferably has higher performance characteristics than the performance characteristics of the secondary cache 514. The performance characteristics may include and/or be determined based on achievable data throughput, data access times, write performance, etc., e.g., depending on the desired approach.

According to an exemplary approach, which is in no way intended to limit the invention, the primary cache 512 includes DRAM while the secondary cache 514 includes SCM. As such, the DRAM in the primary cache 512 is able to read and/or write data more quickly than the SCM in the secondary cache 514. However, access to data in SCM is significantly quicker than access to data in sequential access memory (e.g., such as HDDs), and even SSDs. For example, SCM is a type of NVRAM which is able to perform read and write operations up to 10 times faster than NAND Flash drives in addition to being more durable. SCM is even capable of achieving log speeds that are nearly as fast as DRAM and static random access memory (SRAM). In view of the lower price associated with SCM in comparison to DRAM, the storage capacity of the secondary cache 514 is preferably much greater than that of the primary cache 512, thereby enabling the secondary cache 514 to store significantly more data than the primary cache 512. SCM also includes a power source to ensure that data is not lost due to a system crash or power failure, thereby providing a desirable combination of persistence and speed.

SCM is thereby capable of providing a number of benefits, including significantly fast database-server restarts during maintenance, power emergencies, expected and/or unexpected reboots, etc. Various operational applications and databases, especially those that desire low-latency, high durability, and strong data consistency, can benefit from the implementation of SCM in the secondary cache 514. Moreover, SCM is capable of delivering higher performance to multi-node, distributed-cloud applications in some approaches.

The secondary cache 514 of FIG. 5 further includes a first tier 516 and a second tier 518 therein. In preferred approaches, the performance characteristics associated with (e.g., achievable by) the first tier 516 of the secondary cache 514 are greater than the performance characteristics associated with the second tier of 518 of the secondary cache 514. In other words, although the secondary cache 514 preferably exhibits lower performance characteristics in comparison to the performance characteristics of the primary cache 512, different tiers in the secondary cache 514 may also exhibit different levels of performance characteristics.

This can be true even in situations where both tiers of the secondary cache 514 include the same type of memory therein. According to an example, which is in no way intended to limit the invention, the first tier 516 and the second tier 518 in the secondary cache 514 both include SCM. Thus, the first tier 516 in the secondary cache 514 preferably includes an implementation of SCM that has higher performance characteristics than the SCM implemented in the second tier 518 in the secondary cache 514. As noted above, the performance characteristics of a given portion of memory (e.g., tier in cache) may include and/or be determined based on achievable data throughput, data access times, write performance, etc., e.g., depending on the desired approach. The first tier 516 in the secondary cache 514 may thereby include SCM which has a greater effective storage capacity, has experienced a fewer number of write operations thereby resulting in a greater average block health therein, is able to read data more quickly, etc., in comparison to the SCM that is included in the second tier 518 in the secondary cache 514, e.g., as would be appreciated by one skilled in the art after reading the present description.

Referring still to data storage system 500, the cache 504 provides memory which is able to satisfy I/O requests that are received in a much more efficient manner with respect to computing resources as well as time in comparison to the local data storage device 506 and/or the remote data storage location 508. Moreover, by including a number of different types of memory in the different portions and/or tiers of the cache 504, the controller 502 may further improve the efficiency by which I/O requests are satisfied by selectively utilizing the different performance characteristics. In some approaches, the I/O requests themselves may indicate which portion(s) of the multi-tiered cache 504 should be used to satisfy the respective I/O requests.

For example, controller 502 may perform any one or more of the processes described below with respect to method 600, e.g., as will soon become apparent. However, it should be noted that the various processes described below in FIGS. 6A-6D can be performed by any desired controller, processor, computing device, etc., which may be included in the data storage system 500, e.g., as would be appreciated by one skilled in the art after reading the present description. According to an example, which is in no way intended to limit the invention, the cache 504 and/or the components included therein may include one or more processors, the local data storage device 506 may include one or more controllers, the remote data storage location 508 may include a data management processor, etc., any of which may perform one or more of the processes described below.

Referring now to FIG. 6A, a method 600 for using multi-tiered cache having different respective performance levels to satisfy I/O requests is illustrated in accordance with one approach. The method 600 may be performed in accordance with the present invention in any of the environments depicted in FIGS. 1-5 , among others, in various approaches. Of course, more or less operations than those specifically described in FIG. 6A may be included in method 600, as would be understood by one of skill in the art upon reading the present descriptions.

Each of the steps of the method 600 may be performed by any suitable component of the operating environment. For example, in various approaches, the method 600 may be partially or entirely performed by a controller, a processor, a computer, etc., or some other device having one or more processors therein. Thus, in some approaches, method 600 may be a computer-implemented method. In such approaches, the computer used to implement the method may include the tape drive itself or a portion thereof such as the controller, the tape, an external host, a server, etc. Moreover, the terms computer, processor and controller may be used interchangeably with regards to any of the approaches herein, such components being considered equivalents in the many various permutations of the present invention.

Moreover, for those approaches having a processor, the processor, e.g., processing circuit(s), chip(s), and/or module(s) implemented in hardware and/or software, and preferably having at least one hardware component may be utilized in any device to perform one or more steps of the method 600. Illustrative processors include, but are not limited to, a central processing unit (CPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), etc., combinations thereof, or any other suitable computing device known in the art.

As shown in FIG. 6A, operation 602 of method 600 includes actually receiving an I/O request. The type of I/O request received in operation 602 may be a read request, a new write request, a modify write request, a deletion request, etc., depending on the approach.

Again, the different performance characteristics associated with each of the types of memory in cache may be selectively utilized to perform certain types of I/O requests. This allows the overall storage system to operate more efficiently while also increasing the longevity of the physical memory components. While a controller performing method 600 may be able to select which portion of memory in a cache should be used to perform an I/O request, in some approaches, the I/O requests themselves may indicate which portion(s) of a multi-tiered cache should be used to satisfy the given I/O request. For instance, the I/O request may include a designated flag, portion of metadata, header information, etc. which designates whether a portion of cache having a relatively high performance should be used to satisfy the I/O request, or a portion of cache having a relatively low performance should be used. This distinction may be made as a result of performing a preliminary evaluation of the I/O request, based on performance experienced in response to previous I/O requests, predicted workloads, etc.

Accordingly, decision 604 includes determining whether the received I/O request includes a bypass indication (also referred to herein as a “bypass hint”). As alluded to above, the bypass indication may be used to indicate that a portion of cache having higher performance characteristics (e.g., see primary cache 512 in FIG. 5 ) should be bypassed and therefore not used to satisfy the corresponding I/O request. Rather, a portion of cache having lower performance characteristics (e.g., see secondary cache 514 in FIG. 5 ), at least in comparison to the portion of cache having higher performance characteristics, should be used to satisfy the given I/O request. Data recall requests may include a bypass indication based on the purpose of the recall. For example, if the recalled data will not be used following the recall, then a bypass indication may be set. However, if the recall is for the purpose of writing to the data, then the data recall may include a write intensive hint, or if the data recall corresponds to a low priority (e.g., a batch job to tape) then a low priority hint may be included. According to an example which is in no way intended to limit the invention, see decisions 630 and 632 of FIG. 6B below.

Again, different types of I/O requests have varying effects on the type of memory that is used to satisfy them. For instance, SCM is more susceptible to wear resulting from performing write intensive I/O requests in comparison to DRAM. Certain types of memory are also better suited to perform specific types of I/O requests. For example, DRAM is able to perform read operations more quickly than SCM. It follows that a predetermined connection may be established between certain types of I/O requests and the type of memory in cache that is utilized to satisfy them.

Referring still to FIG. 6A, method 600 proceeds to operation 606 in response to determining that the I/O request does not include a bypass indication. There, operation 606 includes satisfying the I/O request using a primary cache. As noted above, the presence of a bypass indication may signify that a lower performance portion of cache (e.g., see secondary cache 514 in FIG. 5 ) should be used to satisfy the I/O request. However, I/O requests determined to not include a bypass indication may be sent to a higher performance portion of cache (e.g., see primary cache 512 in FIG. 5 ) as a default. This allows for certain I/O requests to be performed by memory components which are best suited to do so, while a remainder of received I/O requests are satisfied using higher performing memory.

Returning momentarily to decision 604, method 600 alternatively proceeds to operation 608 in response to determining that the I/O request includes a bypass indication. There, operation 608 includes satisfying the I/O request using the secondary cache. Once again, although the secondary cache may have lower performance characteristics than the primary cache, it may be better suited to satisfy the I/O request based on a number of other factors. For instance, the I/O request that was received may be more detrimental to the type of physical memory components that are included in the primary cache in comparison to the physical memory components that are included in the secondary cache. According to another example, it may be more efficient for the secondary cache to satisfy the I/O request rather than transfer data associated with the I/O request to the primary cache and then satisfy the I/O request.

It should also be noted that the I/O request may be satisfied differently depending on the type of I/O request that is received. For example, a data read request may be satisfied by returning a copy of the requested data, while a data write request may be satisfied by actually writing data to memory, e.g., as will be described in further detail below (e.g., see FIGS. 6C-6D below). Moreover, with respect to the present description, “satisfying the I/O request using the secondary cache” and “satisfying the I/O request using a primary cache” may be accomplished in a number of different ways depending on the processing component performing method 600, the physical configuration of the storage system, the types of memory in cache that are available, etc. For example, the I/O request may be satisfied by sending one or more commands to the respective cache which are performed accordingly, while in other instances, one or more instructions are sent to a processor located in cache to be performed, e.g., as would be appreciated by one skilled in the art after reading the present description.

As shown, method 600 proceeds to decision 610 from operation 606 in response to satisfying the I/O request. In other words, method 600 proceeds to decision 610 in response to determining that the data in memory will no longer be accessed with respect to the I/O request which has been completed (e.g., also referred to as “track end access”). There, decision 610 includes determining data associated with the I/O request has been updated as a result of satisfying the I/O request. In other words, decision 610 includes determining whether data was merely accessed (e.g., read, inspected, etc.) or actually modified (e.g., written, deleted, etc.).

In response to determining that the data associated with the I/O request has been updated as a result of satisfying the I/O request, method 600 proceeds to operation 612. There, operation 612 includes destaging the updated data from the primary cache to a data storage device. In other words, operation 612 includes actually writing the updated data from the cache to the data storage device itself. The data storage device preferably includes a greater storage capacity than the primary and/or secondary caches and serves as a storage option for data that is received and processed by the caches. It follows that the data storage device may be used to store and provide continued access to relatively colder data that has been flushed out of the caches.

The data storage device is local with respect to the primary and secondary caches in some approaches (e.g., see 506 of FIG. 5 above), while in other approaches the data storage device may actually be remote (e.g., see 508 of FIG. 5 above). According to an illustrative approach, the data storage device may be a cloud object storage implemented as a part of a cloud computing environment. Thus, the process of destaging the updated data from the primary cache to a data storage device may vary in terms of how and/or where the updated data is transferred thereto, e.g., as would be appreciated by one skilled in the art after reading the present description.

From operation 612, method 600 proceeds to operation 614 which includes copying the updated data to the secondary cache. In addition to destaging the updated data from the primary cache to a data storage device, it is preferred that the updated data remains in cache at least temporarily following the I/O request. As a result, any subsequent I/O requests involving the same data may be satisfied without having to query the data storage device, thereby improving efficiency and reducing data access times.

Operation 616 further includes demoting the updated data from the primary cache. This desirably frees space in the primary cache which may be utilized to perform additional I/O requests, while also keeping the updated data in the secondary portion of the cache. Should additional I/O requests be received which correspond to the updated data while it is still located in the secondary cache, the secondary cache and/or primary cache may satisfy the I/O requests more quickly and efficiently than if the updated data only been destaged to the data storage device.

From operation 616, the flowchart proceeds to operation 618 whereby method 600 may end. However, it should be noted that although method 600 may end upon reaching operation 618, any one or more of the processes included in method 600 may be repeated in order to satisfy additional I/O requests. In other words, any one or more of the processes included in method 600 may be repeated in order to process and satisfy subsequently received I/O requests.

However, returning momentarily to decision 610, it should be noted that method 600 proceeds to operation 620 in response to determining that the data associated with the I/O request has not been updated as a result of satisfying the I/O request. According to an example, data associated with (e.g., specified in) a read request would not be updated as a result of performing the read request. It is likely that a copy of the data associated with the read request is already stored in the data storage device, thereby obviating the process of destaging the data to the data storage device. Accordingly, operation 620 includes copying the data associated with the I/O request from the primary cache to the secondary cache, while operation 622 includes demoting the data associated with the I/O request from the primary cache. From operation 622, the flowchart proceeds to operation 618 whereby method 600 may end, e.g., as described above.

However, it should be noted that an optional determination may be made as to whether a copy of the data associated with the I/O request is already stored in the data storage device. In response to determining that the data associated with the I/O request is not already stored in the data storage device, it may be destaged from the primary cache to the data storage device. It should also be noted that any one or more of the approaches described above with respect to performing operations 614 and 616 may be implemented in order to perform operations 620 and 622, respectively.

Returning now to operation 608, there method 600 includes satisfying the I/O request using the secondary cache. As noted above, the I/O request may be satisfied differently depending on the type of I/O request that is received. For example, a data read request may be satisfied by returning a copy of the requested data, while a data write request may be satisfied by actually writing data to memory, e.g., as will be described in further detail below (e.g., see FIGS. 6C-6D below). From operation 608, method 600 proceeds to decision 624 in response to satisfying the I/O request. In other words, method 600 proceeds to decision 624 in response to determining that the data in memory will no longer be accessed with respect to the I/O request which has been completed (e.g., also referred to as “track end access”).

There, decision 624 includes determining whether data associated with the I/O request has been updated as a result of satisfying the I/O request. In response to determining that the data associated with the I/O request has been updated as a result of satisfying the I/O request, method 600 proceeds to operation 626. There, operation 626 includes destaging the updated data from the secondary cache to the data storage device before proceeding to operation 618. Operation 626 thereby ensures that a copy of the updated data associated with the I/O request remains in the secondary cache in addition to being stored in the data storage device, thereby improving data accessibility as well as data retention. Returning to decision 624, method 600 proceeds directly to operation 618 in response to determining that the data associated with the I/O request has not been updated as a result of satisfying the I/O request. In other words, the data associated with the I/O request is simply maintained in the secondary cache.

The process of copying data from the primary cache to the secondary cache as described above with respect to operations 614 and 620 may be performed using any data copying processes which would be apparent to one skilled in the art after reading the present description. However, in some approaches the secondary cache may include more than one tier therein (e.g., see first and second tiers 516, 518 of the secondary cache 514 in FIG. 5 ) which may have an effect on where the data is copied to. For example, certain types of data (e.g., write intensive data) may benefit from the higher performance characteristics of a first tier in the secondary cache in comparison to the lower performance characteristics of a second tier of the secondary cache. According to another example, the higher performance characteristics of a first tier in the secondary cache may be reserved for certain data (e.g., data having a high priority) while the second tier of the secondary cache may be used as a default copy target in operation 614 and/or operation 620.

Referring now to FIG. 6B, exemplary sub-processes of copying data from the primary cache to a secondary cache having first and second tiers therein are illustrated in accordance with one approach. One or more of the sub-processes in FIG. 6B may be used to perform operation 614 and/or operation 620 of FIG. 6A. However, it should be noted that the sub-processes of FIG. 6B are illustrated in accordance with one approach which is in no way intended to limit the invention.

As shown, the flowchart includes determining whether the I/O request has a high priority associated therewith. See decision 630. The priority that is associated with a given portion of data may be designated by a user, determined based on a relative heat of the data, identified based on an age of the data, etc., depending on the desired approach. Data having a higher priority, at least in comparison to data having a lower priority, is preferably copied to the first tier of the secondary cache such that the higher priority data is afforded the higher performance characteristics of the first tier. This allows for higher priority data to be read, written to, transferred, etc., more quickly and with better accuracy than if the higher priority data were copied to the second tier of the secondary cache.

Accordingly, in response to determining that the I/O request has a high priority associated therewith, the flowchart proceeds from decision 630 to sub-operation 634. There, sub-operation 634 includes copying the data to the first tier of SCM. However, in response to determining that the I/O request does not have a high priority associated therewith, the flowchart advances to decision 632 where a determination is made as to whether the I/O request has a high write intensity associated therewith. In other words, decision 632 determines whether the data associated with the I/O request has been designated as being write intensive.

With respect to the present description, data that is “write intensive” may include data that has experienced a predetermined number of write update operations in a predetermined amount of time, is designated as such by a user who predicts the data will experience an above-average number of write operations, includes a type of information which typically experiences a high number of write operations, etc. Moreover, data may be designated as having a high write intensity associated therewith in a number of different ways. For instance, data may be designated as having a high write intensity using one or more flags, by appending identifier information thereto, updating metadata stored in a lookup table entry that corresponds to the data, etc.

In response to determining that the I/O request has a high write intensity associated therewith, the flowchart proceeds from decision 630 to sub-operation 634 where the data is copied to the first tier of SCM. The higher performance characteristics of the first tier in the secondary cache may be best suited to satisfy the high write intensity associated with the data. According to another example, the physical components in the first tier of the secondary cache may have a higher endurance than those in the second tier of the secondary cache, thereby providing a more effective storage location for the data.

However, in response to determining that the I/O request does not have a high write intensity associated therewith, the flowchart proceeds from decision 632 to sub-operation 636 where the data is copied to the second tier of SCM. As noted above, memory having higher performance characteristics may be reserved for certain types of data, while memory having lower performance characteristics is otherwise used as a default storage location. It follows that the illustrative approach corresponding to FIG. 6B reserves the higher performance characteristics of the first tier in the secondary cache for data having a high write intensity associated therewith and/or data that has a high priority associated therewith. All remaining data may be stored in the second tier of the secondary cache as a default.

As previously mentioned, an I/O request may be satisfied differently depending on the type of I/O request that is received. For example, a data read request may be satisfied by returning a copy of the requested data, while a data write request may be satisfied by actually writing data to memory. Referring now to FIGS. 6C-6D, exemplary sub-processes of satisfying a write request and satisfying a read request respectively, are illustrated in accordance with specific approaches. Any one or more of the sub-processes illustrated in FIGS. 6C-6D may be used to perform operation 606 of FIG. 6A. However, it should be noted that the sub-processes of FIGS. 6C-6D are illustrated in accordance with one approach which is in no way intended to limit the invention. For instance, sub-processes which are similar to any one or more of those included in FIGS. 6C-6D may be implemented (at least in part) to perform operation 608 of FIG. 6A, e.g., as would be appreciated by one skilled in the art after reading the present description.

Looking specifically to FIG. 6C, again the flowchart corresponds to satisfying a received I/O request which is a write request. As shown, decision 640 includes determining whether the data associated with the I/O request is already located in the primary cache. In other words, decision 640 determines whether any of the requested data involved with performing the write request is already stored in the primary cache. Decision 640 may be performed by accessing a lookup table which outlines what data is stored in the primary cache, actually inspecting the data stored in the primary cache, etc., or any other process which would be apparent to one skilled in the art after reading the present description.

In response to determining that the data associated with the I/O request is already located in the primary cache, the flowchart advances to sub-operation 642. There, sub-operation 642 includes satisfying the I/O request using the portion of data associated with the I/O request already located in the primary cache. However, in response to determining that the data associated with the I/O request is not already located in the primary cache, the flowchart advances to decision 644 which includes determining whether the data associated with the I/O request is located in the secondary cache. As noted above, data is preferably copied from the primary cache to the secondary cache before being removed from the primary cache. Thus, any subsequent I/O requests involving the same data may be satisfied without having to query a data storage device, thereby improving efficiency and reducing data access times.

It follows that in response to determining that data associated with the I/O request is located in the secondary cache, the flowchart proceeds to sub-operation 646. There, sub-operation 646 includes causing the data associated with the I/O request to be copied from the secondary cache to the primary cache. Sub-operation 646 may be performed by actually copying the data associated with the I/O request from the secondary cache to the primary cache in some approaches, while in other approaches one or more instructions may be sent to a cache processor which actually manages the data that is stored in the primary and secondary caches. It follows that the data associated with the I/O request to be copied from the secondary cache to the primary cache using any processes which would be apparent to one skilled in the art after reading the present description.

Moreover, sub-operation 648 includes invalidating the data associated with the I/O request which is located in the secondary cache. As noted above, the sub-processes included in FIG. 6C correspond to satisfying a write request. Therefore, the data that has been copied to the primary cache will likely be modified as a result of performing the write request therewith. Invalidating the copy of the data that remains in the secondary cache avoids any confusion in terms of which copy accurately portrays the current state of the data.

Sub-operation 650 further includes satisfying the I/O request using the copy of the portion of data associated with the I/O request located in the primary cache. The primary cache is thereby used to satisfy the received write request.

Returning to decision 644, in response to determining that none of the data associated with the I/O request is already located in the secondary cache, the flowchart advances to decision 652. There, decision 652 includes determining whether data associated with the I/O request is located in a data storage device. Again, a data storage device preferably has a much greater storage capacity than the primary and/or secondary caches, and is used as a long-term storage solution for data which has been flushed from the caches.

The flowchart proceeds to sub-operation 654 in response to determining that the data associated with the I/O request is located in the data storage device. There, sub-operation 654 includes causing the data associated with the I/O request to be copied from the data storage device to the primary cache. Moreover, sub-operation 656 includes invalidating the data associated with the I/O request located in the data storage device. As noted above, invalidating additional copies of the data associated with the write request avoids confusion in terms of which copy accurately portrays the current state of the data. It also allows for subsequent copies of the data to be stored in any desired location in the data storage device (e.g., as opposed to having to overwrite the outdated copy of the data).

With continued reference to FIG. 6C, sub-operation 658 includes satisfying the I/O request using the copy of the data associated with the I/O request now located in the primary cache. However, returning to decision 652, data associated with the I/O request may not be located in the data storage device either. Write operations received by the overarching data storage system typically correspond to data that is stored somewhere in a data storage device of the storage system, yet in some situations a new write operation is be received. A new write operation includes data which has not already been stored in memory (e.g., such as a host write, new file creation, etc.) and therefore may not involve any of the data that is stored in the memory. The flowchart thereby proceeds to sub-operation 660 in response to determining that data associated with the I/O request is not located in a data storage device. There, sub-operation 660 includes satisfying the I/O request using the primary cache, e.g., by performing a new write operation.

It should be noted however, that sometimes I/O requests are sent to the wrong target location, are corrupted in-transit, correspond to data stored in a remote storage location, etc., depending on the situation. In these situations, it is desirable that the I/O requests are failed. A determination as to whether a received I/O request was delivered to the correct target location may be performed prior to actually failing the I/O request. Moreover, a notification may be returned to the source of the I/O request indicating that the request has been failed.

Looking specifically now to FIG. 6D, the flowchart corresponds to satisfying a received I/O request which is a read request. As shown, decision 670 includes determining whether the data associated with the I/O request is already located in the primary cache. In other words, decision 670 determines whether the data being requested in the read request is already stored in the primary cache. Decision 670 may be performed by accessing a lookup table which outlines what data is stored in the primary cache, actually inspecting the data stored in the primary cache, etc., or any other process which would be apparent to one skilled in the art after reading the present description.

In response to determining that the data associated with the I/O request is already located in the primary cache, the flowchart proceeds to sub-operation 672 which includes satisfying the I/O request using the data that is already located in the primary cache. In preferred approaches, the read operation is satisfied by returning the requested data to the source of the request, but the read request may be satisfied using any processes which would be apparent to one skilled in the art after reading the present description.

However, in response to determining that the data associated with the I/O request is not already located in the primary cache, the flowchart proceeds to decision 674 which determines whether the data associated with the I/O request is located in the secondary cache. Once again, data is preferably copied from the primary cache to the secondary cache before being removed from the primary cache. Thus, any subsequent I/O requests involving the same data may be satisfied without having to query a data storage device, thereby improving efficiency and reducing data access times. It follows that in response to determining that the data associated with the I/O request is located in the secondary cache, the flowchart proceeds to sub-operation 676. There sub-operation 676 includes causing the data associated with the I/O request to be copied from the secondary cache to the primary cache, while sub-operation 678 includes satisfying the I/O request using the copy of the data associated with the I/O request located in the primary cache.

Returning to decision 674, in response to determining that the data associated with the I/O request is not located in the secondary cache, the flowchart advances to sub-operation 680. There, sub-operation 680 includes causing the data associated with the I/O request to be copied from the data storage device to the primary cache, while sub-operation 682 includes satisfying the I/O request using the copy of the data associated with the I/O request located in the primary cache. As noted above, read operations received by the overarching data storage system typically correspond to data that is at least stored somewhere in a data storage device of the storage system. However, sometimes read requests are sent to the wrong target location, are corrupted in-transit, correspond to data stored in a remote storage location, etc., depending on the situation. In these situations, it is desirable that the read requests are failed. A determination as to whether a received read request was delivered to the correct target location may be performed prior to actually failing the read request. Moreover, a notification may be returned to the source of the read request indicating that the request has been failed.

It follows that various ones of the approached described herein are able to significantly improve the process of satisfying I/O requests that are received. Again, data can be recalled directly from a data storage device (e.g., such as cloud object storage implemented as a part of a cloud computing environment) into cache. Some recalled data may not actually be used for some time, thereby causing the cache to become polluted until the recalled data is actually used or aged out if left unchecked. However, some of the approaches included herein are able to selectively bypass a primary portion of the cache and store recalled data in a secondary cache. The basis of the data recall operations themselves are used to distinguish between them and decide if the recalled data should be stored in primary cache or secondary cache. While the primary cache preferably has higher performance characteristics than the secondary cache, the secondary cache preferably has a greater storage capacity, and is more resistant to wear caused by performing writing operations. It follows that the primary cache may be utilized to perform certain data operations (e.g., which involve high-priority and/or hot data), while the secondary cache is used as a default for the remaining data operations and to store data that has not yet been flushed out of cache.

Applications may also be able to provide input which indicate that the primary cache should be bypassed in favor of using the secondary cache (e.g., also referred to herein as “bypass indications” or “bypass hints”). This input may be provided based on the reason data is being recalled to cache, the type of data that is being recalled, supplemental information provided by a host, etc. The input may further be used to determine which tier in a given portion of cache should be used to store the data and/or perform the I/O request. For example, the secondary cache may have more than one tier therein, e.g., as described in the various approaches above. It should also be noted that although some of the approaches herein depict the secondary cache as including only a first tier and a second tier therein (e.g., see 516 and 518 of FIG. 5 ), the secondary cache and/or the primary cache may each include any desired number of tiers, each tier preferably having different achievable performance characteristics.

It follows that at least some of the improvements achieved herein correspond to moving data within a cache having both DRAM and SCM during normal operations. In other words, both DRAM and SCM can be used together as one cache. The DRAM portion of the cache will have higher performance characteristics than the SCM portion of the cache, which will exhibit lower performance characteristics in comparison to those of the DRAM portion of cache. Moreover, some of the approaches herein ensure that data that is to be transferred to a data storage device (e.g., local HDD, remote cloud storage environment, etc.) are in the SCM portion of the cache at the time of transfer.

As noted herein, SCM is a form of non-volatile memory which is significantly less expensive than DRAM and which provides data access speeds which are significantly higher than those achievable by SSDs. Although SCM experiences higher latency than DRAM (e.g., a few microsecs for SCM compared to nanoseconds for DRAM), it performs much better than SSDs which can experience greater than 100 microsecs of latency. SCM cache can also be configured to have multiple tiers, each tier having different performance characteristics with respect to the other tiers in the SCM cache. For example, a higher class tier may have high write endurance and improved data performance capabilities, while a lower tier may have low write endurance and reduced data performance capabilities.

Additionally, some of the approaches herein are able to desirably reduce the amount of processing overhead that is experienced by the system as a whole. For example, traditional procedures of pushing I/O commands directly to a remote data storage device consumes a significant amount of processing power. In sharp contrast, the cache included in the various approaches herein is able to satisfy I/O requests much more quickly and efficiently.

The present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be accomplished as one step, executed concurrently, substantially concurrently, in a partially or wholly temporally overlapping manner, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

Moreover, a system according to various embodiments may include a processor and logic integrated with and/or executable by the processor, the logic being configured to perform one or more of the process steps recited herein. The processor may be of any configuration as described herein, such as a discrete processor or a processing circuit that includes many components such as processing hardware, memory, I/O interfaces, etc. By integrated with, what is meant is that the processor has logic embedded therewith as hardware logic, such as an application specific integrated circuit (ASIC), a FPGA, etc. By executable by the processor, what is meant is that the logic is hardware logic; software logic such as firmware, part of an operating system, part of an application program; etc., or some combination of hardware and software logic that is accessible by the processor and configured to cause the processor to perform some functionality upon execution by the processor. Software logic may be stored on local and/or remote memory of any memory type, as known in the art. Any processor known in the art may be used, such as a software processor module and/or a hardware processor such as an ASIC, a FPGA, a central processing unit (CPU), an integrated circuit (IC), a graphics processing unit (GPU), etc.

It will be clear that the various features of the foregoing systems and/or methodologies may be combined in any way, creating a plurality of combinations from the descriptions presented above.

It will be further appreciated that embodiments of the present invention may be provided in the form of a service deployed on behalf of a customer to offer service on demand.

The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

FIG. 7 illustrates a network architecture 700, in accordance with one approach. As shown in FIG. 7 , a plurality of remote networks 702 are provided including a first remote network 704 and a second remote network 706. A gateway 701 may be coupled between the remote networks 702 and a proximate network 708. In the context of the present network architecture 700, the networks 704, 706 may each take any form including, but not limited to a LAN, a WAN such as the Internet, public switched telephone network (PSTN), internal telephone network, etc.

In use, the gateway 701 serves as an entrance point from the remote networks 702 to the proximate network 708. As such, the gateway 701 may function as a router, which is capable of directing a given packet of data that arrives at the gateway 701, and a switch, which furnishes the actual path in and out of the gateway 701 for a given packet.

Further included is at least one data server 714 coupled to the proximate network 708, and which is accessible from the remote networks 702 via the gateway 701. It should be noted that the data server(s) 714 may include any type of computing device/groupware. Coupled to each data server 714 is a plurality of user devices 716. Such user devices 716 may include a desktop computer, laptop computer, handheld computer, printer, and/or any other type of logic-containing device. It should be noted that a user device 711 may also be directly coupled to any of the networks, in some approaches.

A peripheral 720 or series of peripherals 720, e.g., facsimile machines, printers, scanners, hard disk drives, networked and/or local data storage units or systems, etc., may be coupled to one or more of the networks 704, 706, 708. It should be noted that databases and/or additional components may be utilized with, or integrated into, any type of network element coupled to the networks 704, 706, 708. In the context of the present description, a network element may refer to any component of a network.

According to some approaches, methods and systems described herein may be implemented with and/or on virtual systems and/or systems which emulate one or more other systems, such as a UNIX® system which virtually hosts a Microsoft® Windows® environment, etc. This virtualization and/or emulation may be enhanced through the use of VMware® software, in some approaches.

In other approaches, one or more networks 704, 706, 708, may represent a cluster of systems commonly referred to as a “cloud.” In cloud computing, shared resources, such as processing power, peripherals, software, data, servers, etc., are provided to any system in the cloud in an on-demand relationship, thereby allowing access and distribution of services across many computing systems. Cloud computing typically involves an Internet connection between the systems operating in the cloud, but other techniques of connecting the systems may also be used, as known in the art.

FIG. 8 shows a representative hardware environment associated with a user device 716 and/or server 714 of FIG. 7 , in accordance with one approach. FIG. 8 illustrates a typical hardware configuration of a processor system 800 having a central processing unit 810, such as a microprocessor, and a number of other units interconnected via a system bus 812, according to one approach. In some approaches, central processing unit 810 may include any of the approaches described above with reference to the one or more processors 210 of FIG. 2 .

The processor system 800 shown in FIG. 8 includes a Random Access Memory (RAM) 814, Read Only Memory (ROM) 816, and an I/O adapter 818. According to some approaches, which are in no way intended to limit the invention, I/O adapter 818 may include any of the approaches described above with reference to I/O adapter 218 of FIG. 2 . Referring still to processor system 800 of FIG. 8 , the aforementioned components 814, 816, 818 may be used for connecting peripheral devices such as storage subsystem 820 to the bus 812. In some approaches, storage subsystem 820 may include a similar and/or the same configuration as data storage system 220 of FIG. 2 . According to an example, which is in no way intended to limit the invention, storage subsystem 820 may include non-volatile data storage cards, e.g., having NVRAM memory cards, RAM, ROM, and/or some other known type of non-volatile memory, in addition to RAID controllers as illustrated in FIG. 2 .

With continued reference to FIG. 8 , a user interface adapter 822 for connecting a keyboard 824, a mouse 826, a speaker 828, a microphone 832, and/or other user interface devices such as a touch screen, a digital camera (not shown), etc., to the bus 812.

Processor system 800 further includes a communication adapter 834 which connects the processor system 800 to a communication network 835 (e.g., a data processing network) and a display adapter 836 which connects the bus 812 to a display device 838.

The processor system 800 may have resident thereon an operating system such as the Microsoft® Windows® Operating System (OS), a macOS®, a UNIX® OS, etc. It will be appreciated that a preferred approach may also be implemented on platforms and operating systems other than those mentioned. A preferred approach may be written using Java®, XML, C, and/or C++ language, or other programming languages, along with an object oriented programming methodology. Object oriented programming (OOP), which has become increasingly used to develop complex applications, may be used.

Moreover, FIG. 9 illustrates a storage system 900 which implements high level (e.g., SSD) storage tiers in combination with lower level (e.g., magnetic tape) storage tiers, according to one approach. Note that some of the elements shown in FIG. 9 may be implemented as hardware and/or software, according to various approaches. The storage system 900 may include a storage system manager 912 for communicating with a plurality of media on at least one higher storage tier 902 and at least one lower storage tier 906. However, in other approaches, a storage system manager 912 may communicate with a plurality of media on at least one higher storage tier 902, but no lower storage tier. The higher storage tier(s) 902 preferably may include one or more random access and/or direct access media 904, such as hard disks, nonvolatile memory (NVM), NVRAM), solid state memory in SSDs, flash memory, SSD arrays, flash memory arrays, etc., and/or others noted herein or known in the art. According to illustrative examples, FIGS. 3-4 show exemplary architectures of SSD systems which may be used as a higher storage tier 902 depending on the desired approach.

Referring still to FIG. 9 , the lower storage tier(s) 906 preferably includes one or more lower performing storage media 908, including sequential access media such as magnetic tape in tape drives and/or optical media, slower accessing HDDs, slower accessing SSDs, etc., and/or others noted herein or known in the art. One or more additional storage tiers 916 may include any combination of storage memory media as desired by a designer of the system 900. Thus, the one or more additional storage tiers 916 may, in some approaches, include an SSD system architecture similar or the same as those illustrated in FIGS. 1-2 . Also, any of the higher storage tiers 902 and/or the lower storage tiers 906 may include any combination of storage devices and/or storage media.

The storage system manager 912 may communicate with the storage media 904, 908 on the higher storage tier(s) 902 and lower storage tier(s) 906 through a network 910, such as a storage area network (SAN), as shown in FIG. 9 , or some other suitable network type. The storage system manager 912 may also communicate with one or more host systems (not shown) through a host interface 914, which may or may not be a part of the storage system manager 912. The storage system manager 912 and/or any other component of the storage system 900 may be implemented in hardware and/or software, and may make use of a processor (not shown) for executing commands of a type known in the art, such as a central processing unit (CPU), a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), etc. Of course, any arrangement of a storage system may be used, as will be apparent to those of skill in the art upon reading the present description.

In more approaches, the storage system 900 may include any number of data storage tiers, and may include the same or different storage memory media within each storage tier. For example, each data storage tier may include the same type of storage memory media, such as HDDs, SSDs, sequential access media (tape in tape drives, optical disk in optical disk drives, etc.), direct access media (CD-ROM, DVD-ROM, etc.), or any combination of media storage types. In one such configuration, a higher storage tier 902, may include a majority of SSD storage media for storing data in a higher performing storage environment, and remaining storage tiers, including lower storage tier 906 and additional storage tiers 916 may include any combination of SSDs, HDDs, tape drives, etc., for storing data in a lower performing storage environment. In this way, more frequently accessed data, data having a higher priority, data needing to be accessed more quickly, etc., may be stored to the higher storage tier 902, while data not having one of these attributes may be stored to the additional storage tiers 916, including lower storage tier 906. Of course, one of skill in the art, upon reading the present descriptions, may devise many other combinations of storage media types to implement into different storage schemes, according to the approaches presented herein.

According to some approaches, the storage system (such as 900) may include logic configured to receive a request to open a data set, logic configured to determine if the requested data set is stored to a lower storage tier 906 of a tiered data storage system 900 in multiple associated portions, logic configured to move each associated portion of the requested data set to a higher storage tier 902 of the tiered data storage system 900, and logic configured to assemble the requested data set on the higher storage tier 902 of the tiered data storage system 900 from the associated portions.

Of course, this logic may be implemented as a method on any device and/or system or as a computer program product, according to various approaches.

For instance, the remote data storage location 508 of FIG. 5 may be cloud object storage implemented as a part of a cloud computing environment, e.g., as noted above. However, it is to be understood that although this disclosure includes a detailed description on cloud computing, implementation of the teachings recited herein are not limited to a cloud computing environment. Rather, approaches of the present invention are capable of being implemented in conjunction with any other type of computing environment now known or later developed.

Cloud computing is a model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g., networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services) that can be rapidly provisioned and released with minimal management effort or interaction with a provider of the service. This cloud model may include at least five characteristics, at least three service models, and at least four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provision computing capabilities, such as server time and network storage, as needed automatically without requiring human interaction with the service's provider.

Broad network access: capabilities are available over a network and accessed through standard mechanisms that promote use by heterogeneous thin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to serve multiple consumers using a multi-tenant model, with different physical and virtual resources dynamically assigned and reassigned according to demand. There is a sense of location independence in that the consumer generally has no control or knowledge over the exact location of the provided resources but may be able to specify location at a higher level of abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elastically provisioned, in some cases automatically, to quickly scale out and rapidly released to quickly scale in. To the consumer, the capabilities available for provisioning often appear to be unlimited and can be purchased in any quantity at any time.

Measured service: cloud systems automatically control and optimize resource use by leveraging a metering capability at some level of abstraction appropriate to the type of service (e.g., storage, processing, bandwidth, and active user accounts). Resource usage can be monitored, controlled, and reported, providing transparency for both the provider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer is to use the provider's applications running on a cloud infrastructure. The applications are accessible from various client devices through a thin client interface such as a web browser (e.g., web-based e-mail). The consumer does not manage or control the underlying cloud infrastructure including network, servers, operating systems, storage, or even individual application capabilities, with the possible exception of limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer is to deploy onto the cloud infrastructure consumer-created or acquired applications created using programming languages and tools supported by the provider. The consumer does not manage or control the underlying cloud infrastructure including networks, servers, operating systems, or storage, but has control over the deployed applications and possibly application hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to the consumer is to provision processing, storage, networks, and other fundamental computing resources where the consumer is able to deploy and run arbitrary software, which can include operating systems and applications. The consumer does not manage or control the underlying cloud infrastructure but has control over operating systems, storage, deployed applications, and possibly limited control of select networking components (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for an organization. It may be managed by the organization or a third party and may exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by several organizations and supports a specific community that has shared concerns (e.g., mission, security requirements, policy, and compliance considerations). It may be managed by the organizations or a third party and may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the general public or a large industry group and is owned by an organization selling cloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or more clouds (private, community, or public) that remain unique entities but are bound together by standardized or proprietary technology that enables data and application portability (e.g., cloud bursting for load-balancing between clouds).

A cloud computing environment is service oriented with a focus on statelessness, low coupling, modularity, and semantic interoperability. At the heart of cloud computing is an infrastructure that includes a network of interconnected nodes.

Referring now to FIG. 10 , illustrative cloud computing environment 1050 is depicted. As shown, cloud computing environment 1050 includes one or more cloud computing nodes 1010 with which local computing devices used by cloud consumers, such as, for example, personal digital assistant (PDA) or cellular telephone 1054A, desktop computer 1054B, laptop computer 1054C, and/or automobile computer system 1054N may communicate. Nodes 1010 may communicate with one another. They may be grouped (not shown) physically or virtually, in one or more networks, such as Private, Community, Public, or Hybrid clouds as described hereinabove, or a combination thereof. This allows cloud computing environment 1050 to offer infrastructure, platforms and/or software as services for which a cloud consumer does not need to maintain resources on a local computing device. It is understood that the types of computing devices 1054A-1054N shown in FIG. 10 are intended to be illustrative only and that computing nodes 1010 and cloud computing environment 1050 can communicate with any type of computerized device over any type of network and/or network addressable connection (e.g., using a web browser).

Referring now to FIG. 11 , a set of functional abstraction layers provided by cloud computing environment 1050 (FIG. 10 ) is shown. It should be understood in advance that the components, layers, and functions shown in FIG. 11 are intended to be illustrative only and approaches of the invention are not limited thereto. As depicted, the following layers and corresponding functions are provided:

Hardware and software layer 1160 includes hardware and software components. Examples of hardware components include: mainframes 1161; RISC (Reduced Instruction Set Computer) architecture based servers 1162; servers 1163; blade servers 1164; storage devices 1165; and networks and networking components 1166. In some approaches, software components include network application server software 1167 and database software 1168.

Virtualization layer 1170 provides an abstraction layer from which the following examples of virtual entities may be provided: virtual servers 1171; virtual storage 1172; virtual networks 1173, including virtual private networks; virtual applications and operating systems 1174; and virtual clients 1175.

In one example, management layer 1180 may provide the functions described below. Resource provisioning 1181 provides dynamic procurement of computing resources and other resources that are utilized to perform tasks within the cloud computing environment. Metering and Pricing 1182 provide cost tracking as resources are utilized within the cloud computing environment, and billing or invoicing for consumption of these resources. In one example, these resources may include application software licenses. Security provides identity verification for cloud consumers and tasks, as well as protection for data and other resources. User portal 1183 provides access to the cloud computing environment for consumers and system administrators. Service level management 1184 provides cloud computing resource allocation and management such that required service levels are met. Service Level Agreement (SLA) planning and fulfillment 1185 provide pre-arrangement for, and procurement of, cloud computing resources for which a future requirement is anticipated in accordance with an SLA.

Workloads layer 1190 provides examples of functionality for which the cloud computing environment may be utilized. Examples of workloads and functions which may be provided from this layer include: mapping and navigation 1191; software development and lifecycle management 1192; virtual classroom education delivery 1193; data analytics processing 1194; transaction processing 1195; and using multi-tiered cache to satisfy received I/O requests 1196, e.g., according to any of the approaches included herein. 

What is claimed is:
 1. A system, comprising: a processor, wherein the processor is coupled to: a primary cache, a secondary cache, and a data storage device, wherein the secondary cache includes a first tier of memory and a second tier of memory, wherein performance characteristics associated with the first tier of memory in the secondary cache are greater than performance characteristics associated with the second tier of memory in the secondary cache; and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to: in response to determining that an input/output (I/O) request includes a bypass indication, determine, by the processor, whether to satisfy the I/O request using the first tier of memory in the secondary cache by inspecting the bypass indication; in response to determining to satisfy the I/O request using the first tier of memory in the secondary cache, satisfy, by the processor, the I/O request using the first tier of memory in the secondary cache; and in response to determining that data associated with the I/O request has been updated as the result of satisfying the I/O request using the secondary cache, destage, by the processor, the updated data from the secondary cache to the data storage device.
 2. The system of claim 1, wherein the first tier of memory in the secondary cache is storage class memory and the second tier of memory in the secondary cache is storage class memory.
 3. The system of claim 2, wherein the primary cache includes dynamic random access memory.
 4. The system of claim 1, wherein the logic is configured to: in response to determining that the I/O request does not include a bypass indication, satisfy, by the processor, the I/O request using the primary cache; determine, by the processor, whether data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache; and in response to determining that the data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache: destage, by the processor, the updated data from the primary cache to the data storage device, copy, by the processor, the updated data to the secondary cache, and demote, by the processor, the updated data from the primary cache.
 5. The system of claim 4, wherein copying the updated data to the secondary cache includes: determining whether the I/O request has a high priority associated therewith; in response to determining that the I/O request has a high priority associated therewith, copying the updated data to the first tier of memory; in response to determining that the I/O request does not have a high priority associated therewith, determining whether the I/O request has a high write intensity associated therewith; in response to determining that the I/O request has a high write intensity associated therewith, copying the updated data to the first tier of memory; and in response to determining that the I/O request does not have a high write intensity associated therewith, copying the updated data to the second tier of memory.
 6. The system of claim 1, wherein the logic is configured to: in response to determining that the I/O request does not include a bypass indication, satisfy, by the processor, the I/O request using the primary cache; determine, by the processor, whether data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache; and in response to determining that the data associated with the I/O request has not been updated as the result of satisfying the I/O request using the primary cache: copy, by the processor, the data associated with the I/O request to the secondary cache, and demote, by the processor, the data associated with the I/O request from the primary cache.
 7. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable and/or executable by a processor to cause the processor to: in response to determining that an input/output (I/O) request includes a bypass indication, determine, by the processor, whether to satisfy the I/O request using a first tier of memory in a secondary cache by inspecting the bypass indication, wherein the secondary cache is coupled to a primary cache and a data storage device, wherein the secondary cache includes the first tier of memory and a second tier of memory; in response to determining to satisfy the I/O request using the first tier of memory in the secondary cache, satisfy, by the processor, the I/O request using the first tier of memory in the secondary cache; and in response to determining that data associated with the I/O request has been updated as the result of satisfying the I/O request using the secondary cache, destage, by the processor, the updated data from the secondary cache to the data storage device.
 8. The computer program product of claim 7, wherein the first tier of memory in the secondary cache is storage class memory and the second tier of memory in the secondary cache is storage class memory.
 9. The computer program product of claim 8, wherein the primary cache includes dynamic random access memory.
 10. The computer program product of claim 7, wherein the program instructions are readable and/or executable by the processor to cause the processor to: in response to determining that the I/O request does not include a bypass indication, satisfy, by the processor, the I/O request using the primary cache; determine, by the processor, whether data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache; and in response to determining that the data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache: destage, by the processor, the updated data from the primary cache to the data storage device, copy, by the processor, the updated data to the secondary cache, and demote, by the processor, the updated data from the primary cache.
 11. The computer program product of claim 10, wherein copying the updated data to the secondary cache includes: determining whether the I/O request has a high priority associated therewith; in response to determining that the I/O request has a high priority associated therewith, copying the updated data to the first tier of memory; in response to determining that the I/O request does not have a high priority associated therewith, determining whether the I/O request has a high write intensity associated therewith; in response to determining that the I/O request has a high write intensity associated therewith, copying the updated data to the first tier of memory; and in response to determining that the I/O request does not have a high write intensity associated therewith, copying the updated data to the second tier of memory.
 12. The computer program product of claim 7, wherein the program instructions are readable and/or executable by the processor to cause the processor to: in response to determining that the I/O request does not include a bypass indication, satisfy, by the processor, the I/O request using the primary cache; determine, by the processor, whether data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache; and in response to determining that the data associated with the I/O request has not been updated as the result of satisfying the I/O request using the primary cache: copy, by the processor, the data associated with the I/O request to the secondary cache, and demote, by the processor, the data associated with the I/O request from the primary cache.
 13. A computer-implemented method, comprising: in response to determining that an input/output (I/O) request includes a bypass indication, determining whether to satisfy the I/O request using a first tier of memory in a secondary cache by inspecting the bypass indication, wherein the secondary cache is coupled to a primary cache and a data storage device, wherein the secondary cache includes the first tier of memory and a second tier of memory; in response to determining to satisfy the I/O request using the first tier of memory in the secondary cache, satisfying the I/O request using the first tier of memory in the secondary cache; and in response to determining that data associated with the I/O request has been updated as the result of satisfying the I/O request using the secondary cache, destaging the updated data from the secondary cache to the data storage device.
 14. The computer-implemented method of claim 13, wherein the first tier of memory in the secondary cache is storage class memory and the second tier of memory in the secondary cache is storage class memory.
 15. The computer-implemented method of claim 14, wherein the primary cache includes dynamic random access memory.
 16. The computer-implemented method of claim 13, comprising: in response to determining that the I/O request does not include a bypass indication, satisfying the I/O request using the primary cache; determining whether data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache; and in response to determining that the data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache: destaging the updated data from the primary cache to the data storage device, copying the updated data to the secondary cache, and demoting the updated data from the primary cache.
 17. The computer-implemented method of claim 16, wherein copying the updated data to the secondary cache includes: determining whether the I/O request has a high priority associated therewith; in response to determining that the I/O request has a high priority associated therewith, copying the updated data to the first tier of memory; in response to determining that the I/O request does not have a high priority associated therewith, determining whether the I/O request has a high write intensity associated therewith; in response to determining that the I/O request has a high write intensity associated therewith, copying the updated data to the first tier of memory; and in response to determining that the I/O request does not have a high write intensity associated therewith, copying the updated data to the second tier of memory.
 18. The computer-implemented method of claim 13, comprising: in response to determining that the I/O request does not include a bypass indication, satisfying the I/O request using the primary cache; determining whether data associated with the I/O request has been updated as the result of satisfying the I/O request using the primary cache; and in response to determining that the data associated with the I/O request has not been updated as the result of satisfying the I/O request using the primary cache: copying the data associated with the I/O request to the secondary cache, and demoting the data associated with the I/O request from the primary cache. 